Optimized Quantum Circuit Partitioning

Optimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations

In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004. In particular, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-Cinto an 8-stage computation of the form -H-CCZ-P-H-P-CZ-C-. We show arguments in support of using -CZstages over the -Cstages: not only the use of -CZstages allows a s...

Circuit Partitioning Using Atabu

Tabu Search is a simple combinatorial optimization strategy that has been applied with great success in applications ranging from graph coloring to scheduling and space planning. This paper describes the application of the Tabu Searchh1] heuristic to the circuit partitioning problem. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than ...

Optimized Reversible Multiplier Circuit

Reversible logic circuits have received significant attention in quantum computing, low power CMOS design, optical information processing, DNA computing, bioinformatics, and nanotechnology. This paper presents two new 4× 4 bit reversible multiplier designs which have lower hardware complexity, less garbage bits, less quantum cost and less constant inputs than previous ones, and can be generaliz...

On Multilevel Circuit Partitioning

Depth-Optimized Reversible Circuit Synthesis

In this paper, simultaneous reduction of circuit depth and synthesis cost of reversible circuits in quantum technologies with limited interaction is addressed. We developed a cycle-based synthesis algorithm which uses negative controls and limited distance between gate lines. To improve circuit depth, a new parallel structure is introduced in which before synthesis a set of disjoint cycles are ...